Extending Liapunov's second method to non-Lipschitz Liapunov functions
نویسندگان
چکیده
منابع مشابه
Extending Liapunov's Second Method to Non-lipschitz Liapunov Functions
where/ : U—>R is continuous on the open set UC.RXR, is frequentlystudied by means of a continuous function V: U—*R. I t is sometimes unnecessary to know the solutions explicitly. If for example V is independent of /, V(xo) = 0 for some #o, V(x)>0 for XT^X^ and if for each solution of (E), V(</)(t)) is a monotonically decreasing function of t for t^Oy then x0 is a stable critical point of (E...
متن کاملExtending Lipschitz functions via random metric partitions
Many classical problems in geometry and analysis involve the gluing together of local information to produce a coherent global picture. Inevitably, the difficulty of such a procedure lies at the local boundary, where overlapping views of the same locality must somehow be merged. It is therefore desirable that the boundaries be “smooth,” allowing a graceful transition from one viewpoint to the n...
متن کاملThe Method of Liapunov Functions for Nonlinear Input Systems
The purpose of this work is to survey some possible deenitions of external stability for nonlinear systems and to provide the basic tools for investigating their relationship and dependence on internal stability properties. In particular, we review some early and more recent results about converse Liapunov theorems. To this respect, some improvements are pointed out without proof.
متن کاملConcentration of non-Lipschitz functions and applications
Strong concentration results play a fundamental role in probabilistic combinatorics and theoretical computer science. In this paper, we present several new concentration results developed recently by the author and collaborators. To illustrate the power of these new results, we discuss applications in many different areas of mathematics, from combinatorial number theory to the theory of random ...
متن کاملVariational analysis of non-Lipschitz spectral functions
We consider spectral functions f ◦ λ, where f is any permutation-invariant mapping from Cn to R, and λ is the eigenvalue map from the set of n × n complex matrices to Cn , ordering the eigenvalues lexicographically. For example, if f is the function “maximum real part”, then f ◦ λ is the spectral abscissa, while if f is “maximum modulus”, then f ◦ λ is the spectral radius. Both these spectral f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the American Mathematical Society
سال: 1968
ISSN: 0002-9904
DOI: 10.1090/s0002-9904-1968-11940-8